# !/usr/bin/env python
# -*- coding:utf-8 -*-

from math import sqrt

def prime(n):
    if n==1:
        return False
    for i in range(2, int(sqrt(n) + 1)):
        if n % i == 0:
            return False
    return True

m = 101.01
n = int(m)
if n < m:
    n += 1

count = 0
res = []
while (count < 5):
    if prime(n):
        res.append(str(n))
        count += 1
    n += 1
print(','.join(res))
